Flock Patterns and Context

نویسنده

  • Dmitry Namiot
چکیده

The wide deployment of location detection devices (for example, smartphones) leads to collecting of large datasets in the form of trajectories. There are a whole set of papers devoted to trajectory-based queries. Mostly, they are concentrated on similarity queries. In the same time, there is a constantly groving interest in getting various forms for aggregating behavior of trajectories as groups. The typical task, for example, is find all groups of moving objects that move together. For example, we can find convoys of vehicles, groups of people, etc. In this paper we discuss the task of flocks discovery for context-aware applications, where location data could be replaced by proximity information. We propose a framework and several strategies to discover such patterns in streaming context-related data. Our experiments with real datasets show that the proposed algorithms are scalable and efficient.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient Mining of Closed Flock Patterns from Large Trajectory Data

In this paper, we study the closed pattern mining problem for a class of spatio-temporal patterns, called closed (k, r)-flock patterns in trajectory databases. A (k, r)-flock pattern (Gudmundsson and van Kreveld, 2006) represents a set of moving objects traveling close each other within radius r during time period of length k. Based on the notion of the envelope for a flock pattern, we introduc...

متن کامل

Efficient Mining of Length-Maximal Flock Patterns from Large Trajectory Data

In this paper, we study the problem of mining a class of spatio-temporal patterns, called flock patterns, which represent a groups of moving objects close each other in a given time segment (Gudmundsson and van Kreveld, Proc. ACM GIS’06; Benkert, Gudmundsson, Hubner, Wolle, Computational Geometry, 41:11, 2008). Based on frequent-pattern mining approach, such as Apriori, Eclat, or LCM, we presen...

متن کامل

Trajectory Pattern Mining in Practice - Algorithms for Mining Flock Patterns from Trajectories

In this paper, we implement recent theoretical progress of depth-first algorithms for mining flock patterns (Arimura et al., 2013) based on depth-first frequent itemset mining approach, such as Eclat (Zaki, 2000) or LCM (Uno et al., 2004). Flock patterns are a class of spatio-temporal patterns that represent a groups of moving objects close each other in a given time segment (Gudmundsson and va...

متن کامل

Towards evenly distributed grazing patterns: including social context in sheep management strategies

Background. A large proportion of natural grasslands around the world is exposed to overgrazing resulting in land degradation and biodiversity loss. Although there is an increasing effort in the promotion of sustainable livestock management, rangeland degradation still occurs because animals' foraging behaviour is highly selective at different spatial scales. The assessment of the ecological me...

متن کامل

Orienting a flock via ad hoc teamwork

Ad hoc teamwork refers to the challenge of designing agents that can influence the behavior of a team, without prior coordination with its teammates. This abstract summarizes a portion of our work on influencing a flock of agents to adopt a desired behavior within the context of ad hoc teamwork. We shortly summarize our work on examining how the ad hoc agents should behave in order to orient a ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013